/**
 * @file   main.cpp
 * @author ywl <ywl@ywl-VirtualBox>
 * @date   Fri Oct 28 22:38:44 2022
 * 
 * @brief  Print all elements between two keys in order.
 * 
 * 
 */

#include <iostream>
#include "AvlTree.h"
using namespace std;


int main(int argc, char *argv[])
{
    AvlTree<int> t;
    int NUMS = 2000000;
    const int GAP  =   37;
    int i;

    for( i = GAP; i != 0; i = ( i + GAP ) % NUMS )
        t.insert( i );

    t.printRange(1,1000);

    
    return 0;
}
